Algorithms for generating arguments and counterarguments in propositional logic
نویسندگان
چکیده
منابع مشابه
Algorithms for generating arguments and counterarguments in propositional logic
A common assumption for logic-based argumentation is that an argument is a pair 〈Φ, α〉 where Φ is minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. Different logics provide different definitions for consistency and entailment and hence give us different options for formalising arguments and counterarguments. The expressivity of classical propositional logi...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملPresentation of Arguments and Counterarguments for Tentative Scientific Knowledge
A key goal for a scientist is to find evidence to argue for or against universal statements (in effect first-order formulae) about the world. Building logic-based tools to support this activity could be potentially very useful for scientists to analyse new scientific findings using experimental results and established scientific knowledge. In effect, these logical tools would help scientists to...
متن کاملAn Algorithm for Generating Arguments in Classical Predicate Logic
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair 〈Φ, α〉 where Φ is a minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. Different logics pro...
متن کاملTableaux and Algorithms for Propositional Dynamic Logic with Converse
This paper presents a pre xed tableaux calculus for Proposi tional Dynamic Logic with Converse based on a combination of di erent techniques such as pre xed tableaux for modal logics and model checkers for mu calculus We prove the correctness and completeness of the calcu lus and illustrate its features We also discuss the transformation of the tableaux method naively NEXPTIME into an EXPTIME a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2011
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2011.01.005